Embedding Mobile Ambients into the π - calculus Gabriel Ciobanu , Vladimir Zakharov TR 05 - 07 , November 2005 ISSN 1224 - 9327
نویسندگان
چکیده
The mobile ambient paradigm of mobile computations is very expressive and allows various embeddings into it of other models of computations such as Turing machine, the λ-calculus, and the π-calculus. In this paper we demonstrate that we have a closer relationship between mobile ambients and the π-calculus. We present an embedding of pure mobile ambients into a fragment of the π-calculus, namely the localized sum-free synchronous monadic π-calculus with matching and mismatching. The embedding is achieved by associating a pair of localized π-terms StructureA and Ruler to every mobile ambient A. StructureA simulates the spatial structure of A by means of communication channels. Ruler is a universal π-process intended to simulate the operational semantics of the mobile ambients. This embedding of pure mobile ambients into a subset of the π-calculus opens new ways to the analysis of ambients by means of techniques used in the π-calculus.
منابع مشابه
Translating Mobile Ambients into P Systems
We present a translation of the mobile ambients without communication and replication into P systems with mobile membranes. We introduce a set of developmental rules over membranes, and describe the correspondence between the behaviour of an ambient and the evolution of the its translated membrane system. We give an operational correspondence result between the mobile ambients and P systems. So...
متن کاملTimed Mobile Ambients for Network Protocols
Ambient calculus is a calculus for mobile computing able to express local communications inside hierarchical domains. So far the timing properties have not been considered in the framework of mobile ambients. We add timers to capabilities and ambients, and provide an operational semantics of the new calculus. Certain results are related to the passage of time, and some new behavioural equivalen...
متن کاملExpressing Mobile Ambients in Temporal Logic of Actions
text Temporal logic of actions is a logic for specifying and reasoning about concurrent systems, developed mainly for verification. Ambient calculus is a formalism for describing mobility and distributed computation. We express mobile ambients in temporal logic of actions, provide some results and illustrate the description through examples. Finally we give an implementation of mobile ambients ...
متن کاملCoordinating Parallel Mobile Ambients to Solve SAT Problem in Polynomial Number of Steps
In this paper we present a version of mobile ambients, called parMA, having a weak form of replication and a parallel semantics. We investigate how parMA can solve intractable problems in a polynomial number of computational steps. We use parMA to give a semiuniform solution to a well-known strong NP-complete problem, namely to the Boolean satisfiability problem (SAT).
متن کاملLeader election in rings of ambient processes
Palamidessi has shown that the π-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using communication or restriction. Following Palamidessi’s methods, we deduce that there is no encoding satisfying certain conditions from MA into CCS. We also sh...
متن کامل